package com.example.algorithm.tree;

/**
 * @author : zhy
 * @since : 2022/7/29
 * 递归测试
 */
public class RecursionTest {

    public int fun(int n)
    {
        if(n==1){
            return 1;
        }
        return n*fun(n-1);
    }

    public static void main(String[] args) {
        RecursionTest test = new RecursionTest();
        System.out.println(test.fun(5));
    }
}
